
Persistence and Communication State Transfer in an Asynchronous Pipe Mechanism.

A Programming Framework for Incremental Data Distribution in Iterative Applications.

Spaces Support for Decoupled Communication in Wide%2DArea Parallel Applications.

Persistence and communication state transfer in an asynchronous pipe mechanism.

A Scalable and Efficient Prefix%2DBased Lookup Mechanism for Large%2DScale Grids.

Toward accurate dynamic time warping in linear time and space.

Learning States and Rules for Detecting Anomalies in Time Series.
The normal operation of a device can be characterized in different temporal states. To identify these states, we introduce a segmentation algorithm called Gecko that can determine a reasonable number of segments using our proposed L method. We then use the RIPPER classification algorithm to describe these states in logical rules. Finally, transitional logic between the states is added to create a finite state automaton. Our empirical results, on data obtained from the NASA shuttle program, indicate that the Gecko segmentation algorithm is comparable to a human expert in identifying states, and our L method performs better than the existing permutation tests method when determining the number of segments to return in segmentation algorithms. Empirical results have also shown that our overall system can track normal behavior and detect anomalies.
Data mining methods for anomaly detection KDD%2D2005 workshop report.

Workshop on Visualization and Data Mining for Computer Security %28VizSEC%2FDMSEC 2004%29

Learning States and Rules for Time Series Anomaly Detection.

Determining the Number of Clusters%2FSegments in Hierarchical Clustering%2FSegmentation Algorithms.
Many clustering and segmentation algorithms both suffer from the limitation that the number of clusters/segments are specified by a human user. It is often impractical to expect a human with sufficient domain knowledge to be available to select the number of clusters/segments to return. In this paper, we investigate techniques to determine the number of clusters or segments to return from hierarchical clustering and segmentation algorithms. We propose an efficient algorithm, the L method, that finds the “knee ” in a ‘ # of clusters vs. clustering evaluation metric ’ graph. Using the knee is well-known, but is not a particularly well-understood method to determine the number of clusters. We explore the feasibility of this method, and attempt to determine in which situations it will and will not work. We also compare the L method to existing methods based on the accuracy of the number of clusters that are determined and efficiency. Our results show favorable performance for these criteria compared to the existing methods that were evaluated.
Al surface morphology effect on flip%2Dchip solder bump shear strength.

An Algorithm for Resolving the Join Component Selection Problem in Parallel Join Optimization.

Book Reviews. Review of Advances in Distributed and Parallel Knowledge Discovery.

Distributed and parallel knowledge discovery %28workshop session %2D title only%29.

